A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Incompletely Specified Boolean Functions. PRELIMINARY VERSION
نویسندگان
چکیده
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incompletely specified switching function. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the conventional ones. The proposed Exclusive-Or (xor) expressions such as ESCT can be used to implement an arbitrary Boolean function into a reversible or even a quantum circuit.
منابع مشابه
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Incompletely Specified Boolean Functions using Variable Reordering
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary incompletely specified switching function taking into account the variable ordering. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the ...
متن کاملA Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Incompletely Specified Boolean Functions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incompletely specified switching function. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the conventional ones. The proposed Exclusive-O...
متن کاملA Quantum Algorithm for finding Minimal Exclusive-Or Expressions for incompletely specified Boolean Functions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary incompletely specified switching function. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the conventional ones. The proposed xor expres...
متن کاملA Quantum Algorithm for Finding Minimum Exclusive-Or Expressions. PRELIMINARY VERSION
This paper presents a quantum algorithm for minimizing both Exlusive-or Sum of Complex Terms (ESCT) and Exlusive-or Sum of Products (ESOP) expressions. The proposed algorithm, QMin, takes advantage of the inherrent massive parallelism of quantum circuits. The ESCT expressions produced by QMin are presented in the related bibliography as an attractive architecture for implementing reversible and...
متن کاملEXORCISM-MV-2: Minimization of Exclusive Sum of Products Expressions for Multiple-Valued Input Incompletely Specified Functions
A new cube operation, exorlink, is presented, as well as its application to the minimization of multiple-valued input, multi-output Exclusive Sums Of Products (ESOPs) for incompletely specified Boolean functions. Exorlink generalizes all cube operations such as crosslink. unlink or X-merge introduced by Helliwell, Perkowski, Sasao and other authors. Our program, EXORCISM-MV-2, gives efficient r...
متن کامل